package beautiful.linkedlist.lru;

/**
 * @description:链表节点的构造
 * @author:LWQ
 * @version:1.0
 */
public class SNode<T> {
    //节点存储的数据
    private T element;
    //指针，指向下一个节点的位置
    private SNode next;

    public SNode(T element) {
        this.element = element;
    }

    public SNode(T element, SNode next) {
        this.element = element;
        this.next = next;
    }

    public SNode() {
        this.next = null;
    }

    public T getElement() {
        return element;
    }

    public void setElement(T element) {
        this.element = element;
    }

    public SNode getNext() {
        return next;
    }

    public void setNext(SNode next) {
        this.next = next;
    }
}
